Erratum to: A Framework for Supporting Tree-Like Indexes on the Chord Overlay
نویسندگان
چکیده
منابع مشابه
A Framework for Supporting DBMS-like Indexes in the Cloud
To support “Database as a service” (DaaS) in the cloud, the database system is expected to provide similar functionalities as in centralized DBMS such as efficient processing of ad hoc queries. The system must therefore support DBMS-like indexes, possibly a few indexes for each table to provide fast location of data distributed over the network. In such a distributed environment, the indexes ha...
متن کاملChord-over-Chord Overlay for Peer-to-Peer networks
In structured Peer-to-Peer(P2P) systems such as Chord or Pastry, each node plays an equal role and has the same responsibility. The most important advantage of such approach is scalability: since there are no centralized resources in the system, the system can easily scale to millions of nodes. However, we need to pay a high price for such scalability, as the maintenance cost of such protocols ...
متن کاملUnderstanding Chord Performance and Topology - aware Overlay Construction for Chord
We studied performance of the Chord scalable lookup system with several performance enhancements. For the denser finger technique, we gave analytical result that shows the average lookup path length decreases slower than the maximum length and converges to it as finger density grows higher. Location cache, as implemented in MIT Chord, is shown to be able to reduce the lookup path length by 1/2 ...
متن کاملC2: A New Overlay Network Based on CAN and Chord
In this paper, we present C, a new overlay network based on CAN and Chord. For an n-peer C system, each peer maintains only about O(log n) other peers’ information, and achieves routing within O(log n) hops. For each peer’s join or departure, C can update the routing table within O(log n) messages with high probability. What distinguish C from many other peer-to-peer data-sharing systems are it...
متن کاملC: a new overlay network based on CAN and Chord
In this paper, we present C, a new overlay network based on CAN and Chord. It is primarily designed for a dynamic environment in which peers join and depart the network frequently. For an n-peers C system, each peer maintains only about O(log n) of other peers’ information, and achieves routing within O(log n) hops. For each peer’s joining or departure, C can, in high probability, update the ro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Technology
سال: 2020
ISSN: 1000-9000,1860-4749
DOI: 10.1007/s11390-013-1405-6